Shape Retrieval through Mahalanobis Distance with Shortest Augmenting Path Algorithm

نویسندگان

  • S. Muruganathan
  • N. Devarajan
  • D. Chitra
  • T. Manigandan
چکیده

Shape matching and object recognition plays an vital role in the computer vision. The shape matching is difficult in case of the real world images like mpeg database images since the real world images has the internal and external contours. The Mahalanobis distance based shape context approach is proposed to measure similarity between shapes and exploit it for shape retrieval. The process of shape retrieval identifies the relevant shapes from the data base for the query images. The query image matched with the reference images and it gives the dissimilarity between the shapes. This dissimilarity measures used to identify the relevant images from the databases. The dissimilarity is distance between the two images. The shape matching has the three major steps that are finding correspondence, measusring distance and the applying allinging transformation. The finding correspondence is find the best matching point between the query image and the reference image, The correspondence is solved by the shape context with Shortest augmenting path algorithm. The measuring distance is used to find the distance between the corresponding point. In this study, Mehalanobis distance is used to find the distance between the images. The alligning transformation is used to allign the shapes in order to achieve the best matching point. Object recognition is achieved by the k-nearest neighbor algorithm. The proposed method is simple, invariant to noise and gives better error rate compared to the existing methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shape Retrieval through Angular Distance with Shortest Augmenting Path Algorithm

Problem statement: The shape of an object is very important in object recognition. Shape matching is a challenging problem, especially when articulation and deformation of a part occurs. These variations may be insignificant for human recognition but often cause a matching algorithm to give results that are inconsistent with our perception. Approach: We proposed a customized approach to measure...

متن کامل

Distance-Directed Augmenting Path Algorithms for Maximum Flow and Parametric Maximum Flow Problems

Until recently, fast algorithms for the maximum flow problem have typically proceeded by constructing layered networks and establishing blocking flows in these networks. However, in recent years, new distance-directed algorithms have been suggested that do not construct layered networks but instead maintain a distance label with each node. The distance label of a node is a lower bound on the le...

متن کامل

Face Recognition Using Contour-Based Multiscale Distance Matrix

Face Recognition is an emerging approach in the recent years. In this paper, the formulation of a face recognition approach using contour-based shape descriptor named Multiscale Distance Matrix (MDM) is developed using the concept of inner-distance in the distance matrix instead of the Euclidean distance. In the proposed scheme, first the similarity in the shape of the face is found by taking a...

متن کامل

MRI Image Retrieval Using Wavelet with Mahalanobis Distance Measurement

In content based image retrieval (CBIR) system, the images are represented based upon its feature such as color, texture, shape, and spatial relationship etc. In this paper, we propose a MRI Image Retrieval using wavelet transform with mahalanobis distance measurement. Wavelet transformation can also be easily extended to 2-D (image) or 3-D (volume) data by successively applying 1-D transformat...

متن کامل

Min - Cost Flow Algorithms 10 . 1 Shortest Augmenting Paths : Unit Capacity Networks

Proof: (by induction). We want to show that one SAP doesn’t introduce negative cycles in Gf . Initially there are no negative cost cycles. Feasible prices can be computed by using shortest path distances from s. After finding the shortest s-t path, it has reduced cost 0. Every arc on the path has reduced length 0. This demonstrates that the triangle inequality property is tight on shortest path...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JCS

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2014